0.05/0.10 % Problem : Vampire---4.8_22667 : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : run_E %s %d THM 0.10/0.30 % Computer : n005.cluster.edu 0.10/0.30 % Model : x86_64 x86_64 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.30 % Memory : 8042.1875MB 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.30 % CPULimit : 1440 0.10/0.30 % WCLimit : 180 0.10/0.30 % DateTime : Mon Jul 3 13:03:45 EDT 2023 0.10/0.30 % CPUTime : 0.15/0.41 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.6FAVuRyNhM/Vampire---4.8_22667 0.15/0.41 # Version: 3.1pre001-ho 1.89/0.66 # Preprocessing class: HSLSSMSMSSSNSFA. 1.89/0.66 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 1.89/0.66 # Starting new_ho_10 with 540s (3) cores 1.89/0.66 # Starting sh2lt with 180s (1) cores 1.89/0.66 # Starting new_ho_5 with 180s (1) cores 1.89/0.66 # Starting full_lambda_5 with 180s (1) cores 1.89/0.66 # Starting sh9 with 180s (1) cores 1.89/0.66 # Starting ehoh_best8_lambda with 180s (1) cores 1.89/0.66 # sh2lt with pid 22847 completed with status 0 1.89/0.66 # Result found by sh2lt 1.89/0.66 # Preprocessing class: HSLSSMSMSSSNSFA. 1.89/0.66 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 1.89/0.66 # Starting new_ho_10 with 540s (3) cores 1.89/0.66 # Starting sh2lt with 180s (1) cores 1.89/0.66 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 1.89/0.66 # Search class: HGHSM-FFMS33-MSFFFFNN 1.89/0.66 # partial match(3): FGHSM-FFMS31-MFFFFFNN 1.89/0.66 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.89/0.66 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 78s (1) cores 1.89/0.66 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 22852 completed with status 0 1.89/0.66 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y 1.89/0.66 # Preprocessing class: HSLSSMSMSSSNSFA. 1.89/0.66 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 1.89/0.66 # Starting new_ho_10 with 540s (3) cores 1.89/0.66 # Starting sh2lt with 180s (1) cores 1.89/0.66 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 1.89/0.66 # Search class: HGHSM-FFMS33-MSFFFFNN 1.89/0.66 # partial match(3): FGHSM-FFMS31-MFFFFFNN 1.89/0.66 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.89/0.66 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 78s (1) cores 1.89/0.66 # Preprocessing time : 0.004 s 1.89/0.66 1.89/0.66 # Proof found! 1.89/0.66 # SZS status Theorem 1.89/0.66 # SZS output start CNFRefutation 1.89/0.66 thf(decl_22, type, bool: del). 1.89/0.66 thf(decl_24, type, arr: del > del > del). 1.89/0.66 thf(decl_25, type, mem: $i > del > $o). 1.89/0.66 thf(decl_26, type, ap: $i > $i > $i). 1.89/0.66 thf(decl_28, type, p: $i > $o). 1.89/0.66 thf(decl_31, type, c_2EquantHeuristics_2EGUESS__FORALL__GAP: del > del > $i). 1.89/0.66 thf(decl_32, type, c_2EquantHeuristics_2EGUESS__EXISTS__GAP: del > del > $i). 1.89/0.66 thf(decl_33, type, c_2EquantHeuristics_2EGUESS__FORALL__POINT: del > del > $i). 1.89/0.66 thf(decl_34, type, c_2EquantHeuristics_2EGUESS__EXISTS__POINT: del > del > $i). 1.89/0.66 thf(decl_35, type, c_2EquantHeuristics_2EGUESS__FORALL: del > del > $i). 1.89/0.66 thf(decl_37, type, c_2EquantHeuristics_2EGUESS__EXISTS: del > del > $i). 1.89/0.66 thf(decl_48, type, epred4_4: $i > $i > del > del > $o). 1.89/0.66 thf(decl_49, type, esk1_0: del). 1.89/0.66 thf(decl_50, type, esk2_0: del). 1.89/0.66 thf(decl_51, type, esk3_0: $i). 1.89/0.66 thf(decl_52, type, esk4_0: $i). 1.89/0.66 thf(decl_53, type, esk5_0: $i). 1.89/0.66 thf(decl_55, type, esk7_6: del > del > $i > $i > $i > $i > $i). 1.89/0.66 thf(decl_56, type, esk8_7: del > del > $i > $i > $i > $i > $i > $i). 1.89/0.66 thf(decl_57, type, esk9_6: del > del > $i > $i > $i > $i > $i). 1.89/0.66 thf(decl_58, type, esk10_6: del > del > $i > $i > $i > $i > $i). 1.89/0.66 thf(decl_59, type, esk11_7: del > del > $i > $i > $i > $i > $i > $i). 1.89/0.66 thf(decl_60, type, esk12_6: del > del > $i > $i > $i > $i > $i). 1.89/0.66 thf(decl_61, type, esk13_5: del > del > $i > $i > $i > $i). 1.89/0.66 thf(decl_62, type, esk14_4: del > del > $i > $i > $i). 1.89/0.66 thf(decl_63, type, esk15_5: del > del > $i > $i > $i > $i). 1.89/0.66 thf(decl_64, type, esk16_4: del > del > $i > $i > $i). 1.89/0.66 thf(decl_65, type, epred5_0: $o). 1.89/0.66 thf(decl_66, type, epred6_0: $o). 1.89/0.66 thf(conj_thm_2EquantHeuristics_2EGUESS__REWRITES, axiom, ![X20:del, X22:del, X23:$i]:(((mem @ X23 @ (arr @ X20 @ X22))=>![X24:$i]:(((((((![X31:$i]:(((mem @ X31 @ (arr @ X20 @ X22))=>![X32:$i]:(((mem @ X32 @ (arr @ X22 @ bool))=>(![X33:$i]:((~((p @ (ap @ X32 @ (ap @ X31 @ X33))))<=(mem @ X33 @ X20)))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X22) @ X31) @ X32)))))))&![X34:$i]:(((mem @ X34 @ (arr @ X20 @ X22))=>![X35:$i]:((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X20 @ X22) @ X34) @ X35))<=>![X36:$i]:(((?[X37:$i]:(((mem @ X37 @ X20)&((X36)=(ap @ X34 @ X37))))<=~((p @ (ap @ X35 @ X36))))<=(mem @ X36 @ X22))))<=(mem @ X35 @ (arr @ X22 @ bool)))))))&![X38:$i]:((![X39:$i]:(((![X40:$i]:(((mem @ X40 @ X22)=>(?[X41:$i]:((((X40)=(ap @ X38 @ X41))&(mem @ X41 @ X20)))<=(p @ (ap @ X39 @ X40)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X20 @ X22) @ X38) @ X39)))<=(mem @ X39 @ (arr @ X22 @ bool))))<=(mem @ X38 @ (arr @ X20 @ X22)))))&![X42:$i]:(((mem @ X42 @ (arr @ X20 @ X22))=>![X43:$i]:(((mem @ X43 @ (arr @ X22 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X20 @ X22) @ X42) @ X43))<=>![X44:$i]:(((mem @ X44 @ X20)=>(p @ (ap @ X43 @ (ap @ X42 @ X44)))))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X20 @ X22) @ X23) @ X24))<=>![X45:$i]:(((?[X46:$i]:((~((p @ (ap @ X24 @ (ap @ X23 @ X46))))&(mem @ X46 @ X20)))<=~((p @ (ap @ X24 @ X45))))<=(mem @ X45 @ X22)))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X20 @ X22) @ X23) @ X24))<=>![X47:$i]:(((mem @ X47 @ X22)=>(?[X48:$i]:(((mem @ X48 @ X20)&(p @ (ap @ X24 @ (ap @ X23 @ X48)))))<=(p @ (ap @ X24 @ X47)))))))<=(mem @ X24 @ (arr @ X22 @ bool)))))), file('/export/starexec/sandbox/tmp/tmp.6FAVuRyNhM/Vampire---4.8_22667', conj_thm_2EquantHeuristics_2EGUESS__REWRITES)). 1.89/0.66 thf(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT, conjecture, ![X20:del, X22:del, X23:$i]:(((mem @ X23 @ (arr @ X22 @ X20))=>![X24:$i]:(((mem @ X24 @ (arr @ X20 @ bool))=>![X25:$i]:(((mem @ X25 @ (arr @ X20 @ bool))=>(![X26:$i]:(((mem @ X26 @ X20)=>((p @ (ap @ X24 @ X26))<=(p @ (ap @ X25 @ X26)))))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X22 @ X20) @ X23) @ X25))<=(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X22 @ X20) @ X23) @ X24)))))))))), file('/export/starexec/sandbox/tmp/tmp.6FAVuRyNhM/Vampire---4.8_22667', conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)). 1.89/0.66 thf(ap_tp, axiom, ![X2:del, X5:del, X6:$i]:(((mem @ X6 @ (arr @ X2 @ X5))=>![X7:$i]:(((mem @ X7 @ X2)=>(mem @ (ap @ X6 @ X7) @ X5))))), file('/export/starexec/sandbox/tmp/tmp.6FAVuRyNhM/Vampire---4.8_22667', ap_tp)). 1.89/0.66 thf(c_0_3, plain, ![X20:del, X22:del, X24:$i, X23:$i]:(((epred4_4 @ X23 @ X24 @ X20 @ X22)<=>(((((![X31:$i]:(((mem @ X31 @ (arr @ X20 @ X22))=>![X32:$i]:(((mem @ X32 @ (arr @ X22 @ bool))=>(![X33:$i]:(((mem @ X33 @ X20)=>~(p @ (ap @ X32 @ (ap @ X31 @ X33)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X22) @ X31) @ X32)))))))&![X34:$i]:(((mem @ X34 @ (arr @ X20 @ X22))=>![X35:$i]:(((mem @ X35 @ (arr @ X22 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X20 @ X22) @ X34) @ X35))<=>![X36:$i]:(((mem @ X36 @ X22)=>(~(p @ (ap @ X35 @ X36))=>?[X37:$i]:(((mem @ X37 @ X20)&((X36)=(ap @ X34 @ X37)))))))))))))&![X38:$i]:(((mem @ X38 @ (arr @ X20 @ X22))=>![X39:$i]:(((mem @ X39 @ (arr @ X22 @ bool))=>(![X40:$i]:(((mem @ X40 @ X22)=>((p @ (ap @ X39 @ X40))=>?[X41:$i]:((((X40)=(ap @ X38 @ X41))&(mem @ X41 @ X20))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X20 @ X22) @ X38) @ X39))))))))&![X42:$i]:(((mem @ X42 @ (arr @ X20 @ X22))=>![X43:$i]:(((mem @ X43 @ (arr @ X22 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X20 @ X22) @ X42) @ X43))<=>![X44:$i]:(((mem @ X44 @ X20)=>(p @ (ap @ X43 @ (ap @ X42 @ X44)))))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X20 @ X22) @ X23) @ X24))<=>![X45:$i]:(((mem @ X45 @ X22)=>(~(p @ (ap @ X24 @ X45))=>?[X46:$i]:((~(p @ (ap @ X24 @ (ap @ X23 @ X46)))&(mem @ X46 @ X20))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X20 @ X22) @ X23) @ X24))<=>![X47:$i]:(((mem @ X47 @ X22)=>((p @ (ap @ X24 @ X47))=>?[X48:$i]:(((mem @ X48 @ X20)&(p @ (ap @ X24 @ (ap @ X23 @ X48)))))))))))), introduced(definition)). 1.89/0.66 thf(c_0_4, plain, ![X20:del, X22:del, X23:$i]:(((mem @ X23 @ (arr @ X20 @ X22))=>![X24:$i]:(((mem @ X24 @ (arr @ X22 @ bool))=>(epred4_4 @ X23 @ X24 @ X20 @ X22))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[conj_thm_2EquantHeuristics_2EGUESS__REWRITES]), c_0_3])). 1.89/0.66 thf(c_0_5, plain, (~((epred6_0))<=>![X6:$i, X7:$i]:(~((epred4_4 @ X6 @ X7 @ esk2_0 @ esk1_0)))), introduced(definition)). 1.89/0.66 thf(c_0_6, plain, ![X182:del, X183:del, X184:$i, X185:$i]:((~(mem @ X184 @ (arr @ X182 @ X183))|(~(mem @ X185 @ (arr @ X183 @ bool))|(epred4_4 @ X184 @ X185 @ X182 @ X183)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 1.89/0.66 thf(c_0_7, negated_conjecture, ~(![X20:del, X22:del, X23:$i]:(((mem @ X23 @ (arr @ X22 @ X20))=>![X24:$i]:(((mem @ X24 @ (arr @ X20 @ bool))=>![X25:$i]:(((mem @ X25 @ (arr @ X20 @ bool))=>(![X26:$i]:(((mem @ X26 @ X20)=>((p @ (ap @ X25 @ X26))=>(p @ (ap @ X24 @ X26)))))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X22 @ X20) @ X23) @ X24))=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X22 @ X20) @ X23) @ X25))))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT])])). 1.89/0.66 thf(c_0_8, plain, ![X20:del, X22:del, X24:$i, X23:$i]:(((epred4_4 @ X23 @ X24 @ X20 @ X22)=>(((((![X31:$i]:(((mem @ X31 @ (arr @ X20 @ X22))=>![X32:$i]:(((mem @ X32 @ (arr @ X22 @ bool))=>(![X33:$i]:(((mem @ X33 @ X20)=>~(p @ (ap @ X32 @ (ap @ X31 @ X33)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X20 @ X22) @ X31) @ X32)))))))&![X34:$i]:(((mem @ X34 @ (arr @ X20 @ X22))=>![X35:$i]:(((mem @ X35 @ (arr @ X22 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X20 @ X22) @ X34) @ X35))<=>![X36:$i]:(((mem @ X36 @ X22)=>(~(p @ (ap @ X35 @ X36))=>?[X37:$i]:(((mem @ X37 @ X20)&((X36)=(ap @ X34 @ X37)))))))))))))&![X38:$i]:(((mem @ X38 @ (arr @ X20 @ X22))=>![X39:$i]:(((mem @ X39 @ (arr @ X22 @ bool))=>(![X40:$i]:(((mem @ X40 @ X22)=>((p @ (ap @ X39 @ X40))=>?[X41:$i]:((((X40)=(ap @ X38 @ X41))&(mem @ X41 @ X20))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X20 @ X22) @ X38) @ X39))))))))&![X42:$i]:(((mem @ X42 @ (arr @ X20 @ X22))=>![X43:$i]:(((mem @ X43 @ (arr @ X22 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X20 @ X22) @ X42) @ X43))<=>![X44:$i]:(((mem @ X44 @ X20)=>(p @ (ap @ X43 @ (ap @ X42 @ X44)))))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X20 @ X22) @ X23) @ X24))<=>![X45:$i]:(((mem @ X45 @ X22)=>(~(p @ (ap @ X24 @ X45))=>?[X46:$i]:((~(p @ (ap @ X24 @ (ap @ X23 @ X46)))&(mem @ X46 @ X20))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X20 @ X22) @ X23) @ X24))<=>![X47:$i]:(((mem @ X47 @ X22)=>((p @ (ap @ X24 @ X47))=>?[X48:$i]:(((mem @ X48 @ X20)&(p @ (ap @ X24 @ (ap @ X23 @ X48)))))))))))), inference(split_equiv,[status(thm)],[c_0_3])). 1.89/0.66 thf(c_0_9, negated_conjecture, ![X4:$i, X6:$i]:(((epred6_0)|~((epred4_4 @ X4 @ X6 @ esk2_0 @ esk1_0)))), inference(split_equiv,[status(thm)],[c_0_5])). 1.89/0.66 thf(c_0_10, plain, ![X4:$i, X2:del, X6:$i, X5:del]:(((epred4_4 @ X4 @ X6 @ X2 @ X5)|~((mem @ X4 @ (arr @ X2 @ X5)))|~((mem @ X6 @ (arr @ X5 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_6])). 1.89/0.66 thf(c_0_11, negated_conjecture, ![X146:$i]:(((mem @ esk3_0 @ (arr @ esk2_0 @ esk1_0))&((mem @ esk4_0 @ (arr @ esk1_0 @ bool))&((mem @ esk5_0 @ (arr @ esk1_0 @ bool))&((~(mem @ X146 @ esk1_0)|(~(p @ (ap @ esk5_0 @ X146))|(p @ (ap @ esk4_0 @ X146))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk4_0))&~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk5_0)))))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])). 1.89/0.66 thf(c_0_12, plain, ![X210:del, X211:del, X212:$i, X213:$i, X214:$i, X215:$i, X217:$i, X218:$i, X219:$i, X220:$i, X223:$i, X224:$i, X225:$i, X227:$i, X228:$i, X230:$i, X231:$i, X232:$i, X234:$i, X237:$i, X238:$i, X241:$i]:((((((((((mem @ (esk7_6 @ X210 @ X211 @ X212 @ X213 @ X214 @ X215) @ X210)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X210 @ X211) @ X214) @ X215))|~(mem @ X215 @ (arr @ X211 @ bool))|~(mem @ X214 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((p @ (ap @ X215 @ (ap @ X214 @ (esk7_6 @ X210 @ X211 @ X212 @ X213 @ X214 @ X215))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X210 @ X211) @ X214) @ X215))|~(mem @ X215 @ (arr @ X211 @ bool))|~(mem @ X214 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))&(~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X210 @ X211) @ X214) @ X215))|(~(mem @ X217 @ X210)|~(p @ (ap @ X215 @ (ap @ X214 @ X217))))|~(mem @ X215 @ (arr @ X211 @ bool))|~(mem @ X214 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))&((((mem @ (esk8_7 @ X210 @ X211 @ X212 @ X213 @ X218 @ X219 @ X220) @ X210)|(p @ (ap @ X219 @ X220))|~(mem @ X220 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X210 @ X211) @ X218) @ X219))|~(mem @ X219 @ (arr @ X211 @ bool))|~(mem @ X218 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(((X220)=(ap @ X218 @ (esk8_7 @ X210 @ X211 @ X212 @ X213 @ X218 @ X219 @ X220)))|(p @ (ap @ X219 @ X220))|~(mem @ X220 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X210 @ X211) @ X218) @ X219))|~(mem @ X219 @ (arr @ X211 @ bool))|~(mem @ X218 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))&(((mem @ (esk9_6 @ X210 @ X211 @ X212 @ X213 @ X218 @ X219) @ X211)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X210 @ X211) @ X218) @ X219))|~(mem @ X219 @ (arr @ X211 @ bool))|~(mem @ X218 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((~(p @ (ap @ X219 @ (esk9_6 @ X210 @ X211 @ X212 @ X213 @ X218 @ X219)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X210 @ X211) @ X218) @ X219))|~(mem @ X219 @ (arr @ X211 @ bool))|~(mem @ X218 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(~(mem @ X223 @ X210)|((esk9_6 @ X210 @ X211 @ X212 @ X213 @ X218 @ X219)!=(ap @ X218 @ X223))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X210 @ X211) @ X218) @ X219))|~(mem @ X219 @ (arr @ X211 @ bool))|~(mem @ X218 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))))))&((((mem @ (esk10_6 @ X210 @ X211 @ X212 @ X213 @ X224 @ X225) @ X211)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X210 @ X211) @ X224) @ X225))|~(mem @ X225 @ (arr @ X211 @ bool))|~(mem @ X224 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(((p @ (ap @ X225 @ (esk10_6 @ X210 @ X211 @ X212 @ X213 @ X224 @ X225)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X210 @ X211) @ X224) @ X225))|~(mem @ X225 @ (arr @ X211 @ bool))|~(mem @ X224 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(((esk10_6 @ X210 @ X211 @ X212 @ X213 @ X224 @ X225)!=(ap @ X224 @ X227))|~(mem @ X227 @ X210)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X210 @ X211) @ X224) @ X225))|~(mem @ X225 @ (arr @ X211 @ bool))|~(mem @ X224 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))))&((((X228)=(ap @ X224 @ (esk11_7 @ X210 @ X211 @ X212 @ X213 @ X224 @ X225 @ X228)))|~(p @ (ap @ X225 @ X228))|~(mem @ X228 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X210 @ X211) @ X224) @ X225))|~(mem @ X225 @ (arr @ X211 @ bool))|~(mem @ X224 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((mem @ (esk11_7 @ X210 @ X211 @ X212 @ X213 @ X224 @ X225 @ X228) @ X210)|~(p @ (ap @ X225 @ X228))|~(mem @ X228 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X210 @ X211) @ X224) @ X225))|~(mem @ X225 @ (arr @ X211 @ bool))|~(mem @ X224 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))))&((~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X210 @ X211) @ X230) @ X231))|(~(mem @ X232 @ X210)|(p @ (ap @ X231 @ (ap @ X230 @ X232))))|~(mem @ X231 @ (arr @ X211 @ bool))|~(mem @ X230 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(((mem @ (esk12_6 @ X210 @ X211 @ X212 @ X213 @ X230 @ X231) @ X210)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X210 @ X211) @ X230) @ X231))|~(mem @ X231 @ (arr @ X211 @ bool))|~(mem @ X230 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(~(p @ (ap @ X231 @ (ap @ X230 @ (esk12_6 @ X210 @ X211 @ X212 @ X213 @ X230 @ X231))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X210 @ X211) @ X230) @ X231))|~(mem @ X231 @ (arr @ X211 @ bool))|~(mem @ X230 @ (arr @ X210 @ X211))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))))&(((~(p @ (ap @ X212 @ (ap @ X213 @ (esk13_5 @ X210 @ X211 @ X212 @ X213 @ X234))))|(p @ (ap @ X212 @ X234))|~(mem @ X234 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((mem @ (esk13_5 @ X210 @ X211 @ X212 @ X213 @ X234) @ X210)|(p @ (ap @ X212 @ X234))|~(mem @ X234 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))&(((mem @ (esk14_4 @ X210 @ X211 @ X212 @ X213) @ X211)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((~(p @ (ap @ X212 @ (esk14_4 @ X210 @ X211 @ X212 @ X213)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((p @ (ap @ X212 @ (ap @ X213 @ X237)))|~(mem @ X237 @ X210)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))))))&((((mem @ (esk15_5 @ X210 @ X211 @ X212 @ X213 @ X238) @ X210)|~(p @ (ap @ X212 @ X238))|~(mem @ X238 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&((p @ (ap @ X212 @ (ap @ X213 @ (esk15_5 @ X210 @ X211 @ X212 @ X213 @ X238))))|~(p @ (ap @ X212 @ X238))|~(mem @ X238 @ X211)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211)))&(((mem @ (esk16_4 @ X210 @ X211 @ X212 @ X213) @ X211)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(((p @ (ap @ X212 @ (esk16_4 @ X210 @ X211 @ X212 @ X213)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))&(~(mem @ X241 @ X210)|~(p @ (ap @ X212 @ (ap @ X213 @ X241)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X210 @ X211) @ X213) @ X212))|~(epred4_4 @ X213 @ X212 @ X210 @ X211))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])). 1.89/0.66 thf(c_0_13, negated_conjecture, ![X4:$i, X6:$i]:(((epred6_0)|~((mem @ X4 @ (arr @ esk1_0 @ bool)))|~((mem @ X6 @ (arr @ esk2_0 @ esk1_0))))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 1.89/0.66 thf(c_0_14, negated_conjecture, (mem @ esk5_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.89/0.66 thf(c_0_15, plain, ![X4:$i, X2:del, X7:$i, X6:$i, X5:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ X7) @ X6))|~((mem @ X4 @ X2))|~((p @ (ap @ X6 @ (ap @ X7 @ X4))))|~((epred4_4 @ X7 @ X6 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.89/0.66 thf(c_0_16, plain, ![X4:$i, X2:del, X8:$i, X7:$i, X6:$i, X5:del]:(((p @ (ap @ X4 @ (ap @ X6 @ (esk7_6 @ X2 @ X5 @ X7 @ X8 @ X6 @ X4))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ X6) @ X4))|~((mem @ X4 @ (arr @ X5 @ bool)))|~((mem @ X6 @ (arr @ X2 @ X5)))|~((epred4_4 @ X8 @ X7 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.89/0.66 thf(c_0_17, plain, (~((epred5_0))<=>![X4:$i]:((~((mem @ X4 @ esk2_0))|~((p @ (ap @ esk4_0 @ (ap @ esk3_0 @ X4))))))), introduced(definition)). 1.89/0.66 thf(c_0_18, plain, ![X4:$i, X2:del, X7:$i, X9:$i, X8:$i, X6:$i, X5:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ X4) @ X6)))|~((mem @ X7 @ X2))|~((p @ (ap @ X6 @ (ap @ X4 @ X7))))|~((mem @ X6 @ (arr @ X5 @ bool)))|~((mem @ X4 @ (arr @ X2 @ X5)))|~((epred4_4 @ X8 @ X9 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.89/0.66 thf(c_0_19, negated_conjecture, (p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.89/0.66 thf(c_0_20, negated_conjecture, (mem @ esk4_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.89/0.66 thf(c_0_21, negated_conjecture, (mem @ esk3_0 @ (arr @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 1.89/0.66 thf(c_0_22, negated_conjecture, ![X4:$i]:(((epred6_0)|~((mem @ X4 @ (arr @ esk2_0 @ esk1_0))))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 1.89/0.66 thf(c_0_23, plain, ![X173:del, X174:del, X175:$i, X176:$i]:((~(mem @ X175 @ (arr @ X173 @ X174))|(~(mem @ X176 @ X173)|(mem @ (ap @ X175 @ X176) @ X174)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])). 1.89/0.66 thf(c_0_24, plain, ![X4:$i, X2:del, X22:del, X20:del, X8:$i, X7:$i, X6:$i, X5:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X20 @ X22) @ X4) @ X6))|~((mem @ (esk7_6 @ X2 @ X5 @ X7 @ X8 @ X4 @ X6) @ X20))|~((mem @ X6 @ (arr @ X5 @ bool)))|~((mem @ X4 @ (arr @ X2 @ X5)))|~((epred4_4 @ X4 @ X6 @ X20 @ X22))|~((epred4_4 @ X8 @ X7 @ X2 @ X5)))), inference(spm,[status(thm)],[c_0_15, c_0_16])). 1.89/0.66 thf(c_0_25, plain, ![X4:$i, X2:del, X8:$i, X7:$i, X6:$i, X5:del]:(((mem @ (esk7_6 @ X2 @ X5 @ X4 @ X6 @ X7 @ X8) @ X2)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ X7) @ X8))|~((mem @ X8 @ (arr @ X5 @ bool)))|~((mem @ X7 @ (arr @ X2 @ X5)))|~((epred4_4 @ X6 @ X4 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.89/0.66 thf(c_0_26, negated_conjecture, ![X4:$i]:(((p @ (ap @ esk4_0 @ X4))|~((mem @ X4 @ esk1_0))|~((p @ (ap @ esk5_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_11])). 1.89/0.66 thf(c_0_27, plain, ![X4:$i, X2:del, X7:$i, X6:$i, X5:del]:(((p @ (ap @ X4 @ (ap @ X6 @ (esk15_5 @ X2 @ X5 @ X4 @ X6 @ X7))))|~((p @ (ap @ X4 @ X7)))|~((mem @ X7 @ X5))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ X6) @ X4)))|~((epred4_4 @ X6 @ X4 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.89/0.66 thf(c_0_28, negated_conjecture, (~((epred6_0))|~((epred5_0))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])]), c_0_17]), c_0_5])). 1.89/0.66 thf(c_0_29, negated_conjecture, (epred6_0), inference(spm,[status(thm)],[c_0_22, c_0_21])). 1.89/0.66 thf(c_0_30, plain, ![X4:$i, X6:$i, X5:del, X2:del]:(((mem @ (ap @ X4 @ X6) @ X5)|~((mem @ X4 @ (arr @ X2 @ X5)))|~((mem @ X6 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_23])). 1.89/0.66 thf(c_0_31, plain, ![X4:$i, X6:$i, X5:del, X2:del, X8:$i, X7:$i, X20:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X20) @ X4) @ X6))|~((mem @ X6 @ (arr @ X20 @ bool)))|~((mem @ X4 @ (arr @ X2 @ X20)))|~((epred4_4 @ X4 @ X6 @ X2 @ X5))|~((epred4_4 @ X7 @ X8 @ X2 @ X20)))), inference(spm,[status(thm)],[c_0_24, c_0_25])). 1.89/0.66 thf(c_0_32, negated_conjecture, ![X4:$i]:(((epred5_0)|~((p @ (ap @ esk4_0 @ (ap @ esk3_0 @ X4))))|~((mem @ X4 @ esk2_0)))), inference(split_equiv,[status(thm)],[c_0_17])). 1.89/0.66 thf(c_0_33, negated_conjecture, ![X4:$i, X2:del, X6:$i, X5:del]:(((p @ (ap @ esk4_0 @ (ap @ X4 @ (esk15_5 @ X2 @ X5 @ esk5_0 @ X4 @ X6))))|~((mem @ (ap @ X4 @ (esk15_5 @ X2 @ X5 @ esk5_0 @ X4 @ X6)) @ esk1_0))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ X4) @ esk5_0)))|~((p @ (ap @ esk5_0 @ X6)))|~((epred4_4 @ X4 @ esk5_0 @ X2 @ X5))|~((mem @ X6 @ X5)))), inference(spm,[status(thm)],[c_0_26, c_0_27])). 1.89/0.66 thf(c_0_34, negated_conjecture, ~((epred5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])])). 1.89/0.66 thf(c_0_35, negated_conjecture, ![X4:$i]:(((mem @ (ap @ esk3_0 @ X4) @ esk1_0)|~((mem @ X4 @ esk2_0)))), inference(spm,[status(thm)],[c_0_30, c_0_21])). 1.89/0.66 thf(c_0_36, plain, ![X4:$i, X5:del, X2:del, X7:$i, X8:$i, X6:$i, X20:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X20) @ X4) @ X6))|~((mem @ X6 @ (arr @ X5 @ bool)))|~((mem @ X7 @ (arr @ X5 @ bool)))|~((mem @ X4 @ (arr @ X2 @ X5)))|~((mem @ X8 @ (arr @ X2 @ X5)))|~((epred4_4 @ X4 @ X6 @ X2 @ X20)))), inference(spm,[status(thm)],[c_0_31, c_0_10])). 1.89/0.66 thf(c_0_37, negated_conjecture, ![X4:$i, X2:del, X5:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ esk3_0) @ esk5_0)))|~((mem @ (esk15_5 @ X2 @ X5 @ esk5_0 @ esk3_0 @ X4) @ esk2_0))|~((epred4_4 @ esk3_0 @ esk5_0 @ X2 @ X5))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X5)))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34]), c_0_35])). 1.89/0.66 thf(c_0_38, plain, ![X4:$i, X2:del, X7:$i, X6:$i, X5:del]:(((mem @ (esk15_5 @ X2 @ X5 @ X4 @ X6 @ X7) @ X2)|~((p @ (ap @ X4 @ X7)))|~((mem @ X7 @ X5))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ X6) @ X4)))|~((epred4_4 @ X6 @ X4 @ X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.89/0.66 thf(c_0_39, negated_conjecture, ![X4:$i, X2:del, X7:$i, X6:$i, X5:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ esk1_0) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X2 @ X5) @ X4) @ X6))|~((mem @ X6 @ (arr @ esk1_0 @ bool)))|~((mem @ X4 @ (arr @ X2 @ esk1_0)))|~((mem @ X7 @ (arr @ X2 @ esk1_0)))|~((epred4_4 @ X4 @ X6 @ X2 @ X5)))), inference(spm,[status(thm)],[c_0_36, c_0_14])). 1.89/0.66 thf(c_0_40, plain, ![X4:$i, X2:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ esk2_0 @ X2) @ esk3_0) @ esk5_0)))|~((epred4_4 @ esk3_0 @ esk5_0 @ esk2_0 @ X2))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X2)))), inference(spm,[status(thm)],[c_0_37, c_0_38])). 1.89/0.66 thf(c_0_41, negated_conjecture, ![X4:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ X4) @ X6))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ esk2_0 @ X2) @ X4) @ X6))|~((mem @ X6 @ (arr @ esk1_0 @ bool)))|~((mem @ X4 @ (arr @ esk2_0 @ esk1_0)))|~((epred4_4 @ X4 @ X6 @ esk2_0 @ X2)))), inference(spm,[status(thm)],[c_0_39, c_0_21])). 1.89/0.66 thf(c_0_42, negated_conjecture, ~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk5_0))), inference(split_conjunct,[status(thm)],[c_0_11])). 1.89/0.66 thf(c_0_43, plain, ![X4:$i, X2:del]:((~((epred4_4 @ esk3_0 @ esk5_0 @ esk2_0 @ X2))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X2)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_14]), c_0_21])]), c_0_42])). 1.89/0.66 thf(c_0_44, plain, ![X4:$i, X2:del]:((~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X2)))|~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ X2)))), inference(spm,[status(thm)],[c_0_43, c_0_10])). 1.89/0.66 thf(c_0_45, negated_conjecture, ![X4:$i]:((~((p @ (ap @ esk5_0 @ X4)))|~((mem @ X4 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_21]), c_0_14])])). 1.89/0.66 thf(c_0_46, plain, ![X4:$i, X2:del, X7:$i, X6:$i, X5:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ X4) @ esk5_0))|~((mem @ (ap @ X4 @ (esk7_6 @ X2 @ X5 @ X6 @ X7 @ X4 @ esk5_0)) @ esk1_0))|~((mem @ esk5_0 @ (arr @ X5 @ bool)))|~((mem @ X4 @ (arr @ X2 @ X5)))|~((epred4_4 @ X7 @ X6 @ X2 @ X5)))), inference(spm,[status(thm)],[c_0_45, c_0_16])). 1.89/0.66 thf(c_0_47, negated_conjecture, ![X4:$i, X2:del, X6:$i, X5:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X2 @ X5) @ esk3_0) @ esk5_0))|~((mem @ (esk7_6 @ X2 @ X5 @ X4 @ X6 @ esk3_0 @ esk5_0) @ esk2_0))|~((mem @ esk5_0 @ (arr @ X5 @ bool)))|~((mem @ esk3_0 @ (arr @ X2 @ X5)))|~((epred4_4 @ X6 @ X4 @ X2 @ X5)))), inference(spm,[status(thm)],[c_0_46, c_0_35])). 1.89/0.66 thf(c_0_48, plain, ![X4:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ X2) @ esk3_0) @ esk5_0))|~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X2)))|~((epred4_4 @ X4 @ X6 @ esk2_0 @ X2)))), inference(spm,[status(thm)],[c_0_47, c_0_25])). 1.89/0.66 thf(c_0_49, plain, ![X4:$i, X6:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ X2) @ esk3_0) @ esk5_0))|~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X2)))|~((mem @ X4 @ (arr @ X2 @ bool)))|~((mem @ X6 @ (arr @ esk2_0 @ X2))))), inference(spm,[status(thm)],[c_0_48, c_0_10])). 1.89/0.66 thf(c_0_50, negated_conjecture, ![X4:$i]:(~((mem @ X4 @ (arr @ esk2_0 @ esk1_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_14]), c_0_14]), c_0_21])]), c_0_42])). 1.89/0.66 thf(c_0_51, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_21, c_0_50]), ['proof']). 1.89/0.66 # SZS output end CNFRefutation 1.89/0.66 # Parsed axioms : 75 1.89/0.66 # Removed by relevancy pruning/SinE : 48 1.89/0.66 # Initial clauses : 244 1.89/0.66 # Removed in clause preprocessing : 175 1.89/0.66 # Initial clauses in saturation : 69 1.89/0.66 # Processed clauses : 511 1.89/0.66 # ...of these trivial : 0 1.89/0.66 # ...subsumed : 101 1.89/0.66 # ...remaining for further processing : 410 1.89/0.66 # Other redundant clauses eliminated : 0 1.89/0.66 # Clauses deleted for lack of memory : 0 1.89/0.66 # Backward-subsumed : 12 1.89/0.66 # Backward-rewritten : 3 1.89/0.66 # Generated clauses : 4046 1.89/0.66 # ...of the previous two non-redundant : 3979 1.89/0.66 # ...aggressively subsumed : 0 1.89/0.66 # Contextual simplify-reflections : 1 1.89/0.66 # Paramodulations : 4041 1.89/0.66 # Factorizations : 0 1.89/0.66 # NegExts : 0 1.89/0.66 # Equation resolutions : 1 1.89/0.66 # Total rewrite steps : 182 1.89/0.66 # Propositional unsat checks : 0 1.89/0.66 # Propositional check models : 0 1.89/0.66 # Propositional check unsatisfiable : 0 1.89/0.66 # Propositional clauses : 0 1.89/0.66 # Propositional clauses after purity: 0 1.89/0.66 # Propositional unsat core size : 0 1.89/0.66 # Propositional preprocessing time : 0.000 1.89/0.66 # Propositional encoding time : 0.000 1.89/0.66 # Propositional solver time : 0.000 1.89/0.66 # Success case prop preproc time : 0.000 1.89/0.66 # Success case prop encoding time : 0.000 1.89/0.66 # Success case prop solver time : 0.000 1.89/0.66 # Current number of processed clauses : 393 1.89/0.66 # Positive orientable unit clauses : 10 1.89/0.66 # Positive unorientable unit clauses: 0 1.89/0.66 # Negative unit clauses : 3 1.89/0.66 # Non-unit-clauses : 380 1.89/0.66 # Current number of unprocessed clauses: 3516 1.89/0.66 # ...number of literals in the above : 30730 1.89/0.66 # Current number of archived formulas : 0 1.89/0.66 # Current number of archived clauses : 16 1.89/0.66 # Clause-clause subsumption calls (NU) : 23221 1.89/0.66 # Rec. Clause-clause subsumption calls : 3648 1.89/0.66 # Non-unit clause-clause subsumptions : 111 1.89/0.66 # Unit Clause-clause subsumption calls : 390 1.89/0.66 # Rewrite failures with RHS unbound : 0 1.89/0.66 # BW rewrite match attempts : 1 1.89/0.66 # BW rewrite match successes : 1 1.89/0.66 # Condensation attempts : 0 1.89/0.66 # Condensation successes : 0 1.89/0.66 # Termbank termtop insertions : 187888 1.89/0.66 1.89/0.66 # ------------------------------------------------- 1.89/0.66 # User time : 0.235 s 1.89/0.66 # System time : 0.008 s 1.89/0.66 # Total time : 0.243 s 1.89/0.66 # Maximum resident set size: 2680 pages 1.89/0.67 1.89/0.67 # ------------------------------------------------- 1.89/0.67 # User time : 0.237 s 1.89/0.67 # System time : 0.010 s 1.89/0.67 # Total time : 0.247 s 1.89/0.67 # Maximum resident set size: 1860 pages 1.89/0.67 % E---3.1 exiting 1.89/0.67 EOF